Semantic Acyclicity on Graph Databases
نویسندگان
چکیده
منابع مشابه
Graph Partitioning with Acyclicity Constraints
Graphs are widely used to model execution dependencies in applications. In particular, the NP-complete problem of partitioning a graph under constraints receives enormous attention by researchers because of its applicability in multiprocessor scheduling. We identified the additional constraint of acyclic dependencies between blocks when mapping computer vision and imaging applications to a hete...
متن کاملGraph Analytics on Relational Databases
Graph analytics has become increasing popular in the recent years. Conventionally, data is stored in relational databases that have been refined over decades, resulting in highly optimized data processing engines. However, the awkwardness of expressing iterative queries in SQL makes the relational queryprocessing model inadequate for graph analytics, leading to many alternative solutions. Our r...
متن کاملGraph Analytics on Relational Databases
Graph analytics is getting increasingly popular these days and there is a deluge of new systems for graph analytics. However, it is not clear how good or bad are the relational databases for graph analytics. In this talk, I will share our experiences with graph analytics on relational databases. Contrary to the popular belief, modern relational databases can have very good performance over grap...
متن کاملWhen Acyclicity Is Not Enough: Limitations of the Causal Graph
Causal graphs are widely used in planning to capture the internal structure of planning instances. In the past, causal graphs have been exploited to generate hierarchical plans, to compute heuristics, and to identify classes of planning instances that are easy to solve. It is generally believed that planning is easier when the causal graph is acyclic. In this paper we show that this is not true...
متن کاملOn the Relationship of Joint Acyclicity and Super-Weak Acyclicity
Rules that allow existential quantifiers in the head (conclusion) have been studied extensively in knowledge representation, databases, and logic programming (in the related form of logic programs with function symbols). In general, it is not decidable if a set of such rules admits a finite model, but a number of sufficient conditions have been proposed to detect situations where this is the ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2016
ISSN: 0097-5397,1095-7111
DOI: 10.1137/15m1034714